On Shadows Of Intersecting Families
نویسندگان
چکیده
The shadow minimization problem for t-intersecting systems of finite sets is considered. Let A be a family of k-subsets of N. The -shadow of A is the set of all (k− )-subsets ∂ A contained in the members of A. Let A be a t-intersecting family (any two members have at least t elements in common) with |A| =m. Given k,t,m the problem is to minimize |∂ A| (over all choices of A). In this paper we solve this problem when m is big enough.
منابع مشابه
Erdös-Ko-Rado from intersecting shadows
A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős–Ko–Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corres...
متن کاملNote Erdős–Ko–Rado from intersecting shadows
A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős– Ko–Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corre...
متن کاملShadows and intersections in vector spaces
We prove a vector space analog of a version of the Kruskal-Katona theorem due to Lovász. We apply this result to extend Frankl’s theorem on r-wise intersecting families to vector spaces. In particular, we obtain a short new proof of the ErdősKo-Rado theorem for vector spaces.
متن کاملShadows and intersections: stability and new proofs
We give a short new proof of a version of the Kruskal-Katona theorem due to Lovász. Our method can be extended to a stability result, describing the approximate structure of configurations that are close to being extremal, which answers a question of Mubayi. This in turn leads to another combinatorial proof of a stability theorem for intersecting families, which was originally obtained by Fried...
متن کاملMost Probably Intersecting Hypergraphs
The celebrated Erdős-Ko-Rado theorem shows that for n > 2k the largest intersecting k-uniform set family on [n] has size ( n−1 k−1 ) . It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting. We consider the most prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 24 شماره
صفحات -
تاریخ انتشار 2004